An accuracy enhancement algorithm for hierarchical radiosity
نویسندگان
چکیده
ÐIn this research, we propose an algorithm to enhance the accuracy of the hierarchical radiosity. The proposed approach particularly creates links on the hierarchy in a bottom-up fashion according to both a user-speci®ed error tolerance and the minimum patch area. It diers from the original hierarchical method that creates the links in a top-down manner. In our approach, the upper-level patches have more accurate estimates of the kernel. More accurate error bounds can be obtained for the upper-level patches. These error bounds make the creation of links on the hierarchy more accurate. Furthermore, more accurate form factors can also be obtained for the upper-level patches. Thus, we enhance the accuracy of hierarchical radiosity. # 1998 Elsevier Science Ltd. All rights reserved.
منابع مشابه
An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial applications and one of the most challenging issues remaining in global illumination research. In order to control the error, we need to estimate the accuracy of the calculation while computing the energy exchanged between ...
متن کاملHierarchcal Radiosity on Curved Surfaces
Incorporating curved objects into a hierarchical radiosity system typically bears a great disadvantage: the initial tessellation already needs a large number of small polygons because further mesh enhancement is impossible. We will show that improvements in rendering speed and quality can be made by extending the planar meshing of the refinement step to an object-specific subdivision scheme. Wh...
متن کاملTighter error bounds and weighted error metrics for hierarchical radiosity
In this paper we first derive a tighter error bound on form factors as a subdivision criterion for the hierarchical radiosity algorithm. Such an error bound can reduce more unnecessary links and improve the performance of the hierarchical radiosity algorithm to meet a user-specified error tolerance. We then propose a weighted error metric in form factor computation such that more effort is auto...
متن کاملControlling Memory Consumption of Hierarchical Radiosity With Clustering
Memory consumption is a major limitation of current hierarchical radiosity algorithms, including those using clustering. To overcome this drawback we present a new algorithm which reduces the storage required for both the hierarchy of subdivided elements and the links representing light transfers. Our algorithm is based on a link hierarchy, combined with a progressive shooting algorithm. Links ...
متن کاملComputational requirements for accelerating radiosity algorithms
A major problem in realistic image synthesis is the solution of the rendering equation. The goal of research in this area is aimed at arriving at faster solutions which satisfy the desired numerical and visual accuracy. Radiosity methods provide an effective solution to the rendering equation for lambertian diiuse environments. In this paper we present a brief survey of the various radiosity al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 22 شماره
صفحات -
تاریخ انتشار 1998